Enhancing Demosaicking Algorithms using Loopy Propagation

نویسندگان

  • Kevin Grant
  • David Mould
  • Michael Horsch
  • Eric Neufeld
چکیده

Consumer-level digital cameras observe a single value at each pixel. The remaining two channels of a three-channel image are reconstructed through a process called demosaicking. This paper describes a methodology for enhancing current demosaicking methods. Using an iterative relaxation approach from probabilistic AI literature, our empirical results show that we can improve the results of the standard algorithms using monitored successive application of those algorithms. We apply the new technique to several algorithms: hue-based interpolation, gradient-based interpolation, and adaptive colour plan interpolation; and we show a significant improvement in mean-squared error over both RGB and CIE colour spaces using each of these algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Loopy belief propagation and probabilistic image processing

The hyperparameter estimation in the maximization of the marginal likelihood in the probabilistic image processing is investigated by using the cluster variation method. The algorithms are substantially equivalent to generalized loopy belief propagations.

متن کامل

Improved Sparse Correspondence Resolution Using Loopy Belief Propagation with Mrf Clique Based Structure Preservation

In this paper we develop a novel MRF formulation for calculating sparse features correspondence in image pairs. Our MRF terms can include cliques of variable sizes, and solve these using Loopy Belief Propagation. To calculate our MRF topology we develop a variant of the K-means algorithm which we call the KN-means algorithm (where each mean has a specified number of neighbours). The method is c...

متن کامل

Stable Fixed Points of Loopy Belief Propagation Are Minima of the Bethe Free Energy

We extend recent work on the connection between loopy belief propagation and the Bethe free energy. Constrained minimization of the Bethe free energy can be turned into an unconstrained saddle-point problem. Both converging double-loop algorithms and standard loopy belief propagation can be interpreted as attempts to solve this saddle-point problem. Stability analysis then leads us to conclude ...

متن کامل

Stable Fixed Points of Loopy Belief Propagation Are Local Minima of the Bethe Free Energy

We extend recent work on the connection between loopy belief propagation and the Bethe free energy. Constrained minimization of the Bethe free energy can be turned into an unconstrained saddle-point problem. Both converging double-loop algorithms and standard loopy belief propagation can be interpreted as attempts to solve this saddle-point problem. Stability analysis then leads us to conclude ...

متن کامل

Information Geometry of Propagation Algorithms and Approximate Inference

Consider the inference problem of undirected graphical models[8, 9]. When the graph is tree, the Belief Propagation (BP) algorithm (J.Pearl[11]) is an efficient algorithm and the exact inference is computed. However, when the graph is “loopy,” and the loops are big, the exact inference becomes intractable. Besides sampling methods, such as MCMC, tractable approximate inference gives us one prac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007